Linear combinations of polynomials with three-term recurrence
نویسندگان
چکیده
We study the zero distribution of sum first n polynomials satisfying a three-term recurrence whose coefficients are linear polynomials. also extend this to combination, powers az + b for a, ? R, Chebyshev In particular, we find necessary and sufficient conditions on such that combination is hyperbolic.
منابع مشابه
The root distribution of polynomials with a three-term recurrence
For any fixed positive integer n, we study the root distribution of a sequence of polynomials Hm(z) satisfying the rational generating function ∞ ∑ m=0 Hm(z)t m = 1 1 +B(z)t+A(z)tn where A(z) and B(z) are any polynomials in z with complex coefficients. We show that the roots of Hm(z) which satisfy A(z) 6= 0 lie on a specific fixed real algebraic curve for all large m.
متن کاملOn Linear Combinations of Chebyshev Polynomials
a0Tn(x) + a1Tn−1(x) + · · ·+ amTn−m(x) where (a0, a1, . . . , am) is a fixed m-tuple of real numbers, a0, am 6= 0, Ti(x) are Chebyshev polynomials of the first kind, n = m, m + 1, m + 2, . . . Here we analyze the structure of the set of zeros of such polynomial, depending on A and its limit points when n tends to infinity. Also the expression of envelope of the polynomial is given. An applicati...
متن کاملOn Linear Combinations of Orthogonal Polynomials
In this expository paper, linear combinations of orthogonal polynomials are considered. Properties like orthogonality and interlacing of zeros are presented.
متن کاملLinear Recurrence Relations for Graph Polynomials
A sequence of graphs Gn is iteratively constructible if it can be built from an initial labeled graph by means of a repeated fixed succession of elementary operations involving addition of vertices and edges, deletion of edges, and relabelings. Let Gn be a iteratively constructible sequence of graphs. In a recent paper, [27], M. Noy and A. Ribò have proven linear recurrences with polynomial coe...
متن کاملStability of Roots of Polynomials under Linear Combinations of Derivatives
Let T = α0I + α1D + · · · + αnD n , where D is the differentiation operator and α0 = 0, and let f be a square-free polynomial with large minimum root separation. We prove that the roots of T f are close to the roots of f translated by −α1/α0.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publications De L'institut Mathematique
سال: 2021
ISSN: ['0350-1302', '1820-7405']
DOI: https://doi.org/10.2298/pim2124029t